منابع مشابه
Fast and Accurate Digit Classification
We explore the use of certain image features, blockwise histograms of local orientations, used in many current object recognition algorithms, for the task of handwritten digit recognition. Existing approaches find that polynomial kernel SVMs trained on raw pixels achieve state of the art performance. However such kernel SVM approaches are impractical as they have a huge complexity at runtime. W...
متن کاملRandom and Deterministic Digit Permutations of the Halton Sequence*
The Halton sequence is one of the classical low-discrepancy sequences. It is effectively used in numerical integration when the dimension is small, however, for larger dimensions, the uniformity of the sequence quickly degrades. As a remedy, generalized (scrambled) Halton sequences have been introduced by several researchers since the 1970s. In a generalized Halton sequence, the digits of the o...
متن کاملFast Generation of Fibonacci Permutations
In 1985, Simion and Schmidt showed that |Sn(τ3)|, the cardinality of the set of all length n permutations avoiding the patterns τ3 = {123, 213, 132} is the Fibonacci numbers, fn+1. They also developed a constructive bijection between the set of all binary strings with no two consecutive ones and Sn(τ3). In May 2004, Egge and Mansour generalized this SimionSchmidt counting result and showed that...
متن کاملFast Signed-Digit Multi-operand Decimal Adders
Decimal arithmetic is desirable for high precision requirements of many financial, industrial and scientific applications. Furthermore, hardware support for decimal arithmetic has gained momentum with IEEE 7542008, which standardized decimal floating-point. This paper presents a new architecture for two operand and multi-operand signed-digit decimal addition. Signed-digit architectures are adva...
متن کاملPseudorandom permutations with the fast forward property
We describe an efficient construction of pseudorandom permutations P with the fast forward property, namely, such that for each m the computation of Pm(x) can be done with a constant number of calls to an underlying pseudorandom permutation. This solves an open problem of Naor and Reingold. 1. Ordered cycle structures Definition 1.1. Let Ω be a finite, well-ordered set. The ordered cycle struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Programming
سال: 1996
ISSN: 1058-9244,1875-919X
DOI: 10.1155/1996/836910